- derivative approximation method
- авт. метод приближения производными
English-Russian dictionary of computer science and programming. 2013.
derivative approximation method
Смотреть что такое "derivative approximation method" в других словарях:
Derivative — This article is an overview of the term as used in calculus. For a less technical overview of the subject, see Differential calculus. For other uses, see Derivative (disambiguation) … Wikipedia
Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on … Wikipedia
Method of steepest descent — For the optimization algorithm, see Gradient descent. In mathematics, the method of steepest descent or stationary phase method or saddle point method is an extension of Laplace s method for approximating an integral, where one deforms a contour… … Wikipedia
Stochastic approximation — methods are a family of iterative stochastic optimization algorithms that attempt to find zeroes or extrema of functions which cannot be computed directly, but only estimated via noisy observations. The first, and prototypical, algorithms of this … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Finite difference method — In mathematics, finite difference methods are numerical methods for approximating the solutions to differential equations using finite difference equations to approximate derivatives. Intuitive derivation Finite difference methods approximate the … Wikipedia
Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based … Wikipedia
WKB approximation — In physics, the WKB (Wentzel–Kramers–Brillouin) approximation, also known as WKBJ (Wentzel–Kramers–Brillouin–Jeffreys) approximation, is the most familiar example of a semiclassical calculation in quantum mechanics in which the wavefunction is… … Wikipedia
Householder's method — In numerical analysis, the class of Householder s methods are root finding algorithms used for functions of one real variable with continuous derivatives up to some order d+1 , where d will be the order of the Householder s method.The algorithm… … Wikipedia
Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… … Wikipedia
Aberth method — The Aberth method, sometimes named Aberth Ehrlich method is a root finding algorithm for simultaneous approximation of all the roots of a univariate polynomial. The fundamental theorem of algebra states that for each polynomial with complex… … Wikipedia
